Categorical Semantics of Reference Data Type
نویسندگان
چکیده
Reference types are very useful structures enabling handling with dynamic memory. In this paper we extend categorical model of type system with reference data type. We illustrate our approach on simple functional programming language T-NBL extended with reference type. After constructing parametric algebraic specification we construct categorical model of reference type and we show how our results can be implemented in functional programming language Ocaml.
منابع مشابه
Functorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملارائه یک الگوریتم خوشه بندی برای داده های دسته ای با ترکیب معیارها
Clustering is one of the main techniques in data mining. Clustering is a process that classifies data set into groups. In clustering, the data in a cluster are the closest to each other and the data in two different clusters have the most difference. Clustering algorithms are divided into two categories according to the type of data: Clustering algorithms for numerical data and clustering algor...
متن کاملSemantics of Architectural
A categorical semantics is proposed for the notion of architectural connector in the style defined by Allen and Garlan which adopts notions of parameterisation similar to those developed for Abstract Data Type specification, and adapts them to formalisms for parallel program design. We show how many of the claims made in [1] can be formally substantiated, and generalised to formalisms other tha...
متن کاملSemantics of Architectural Connectors
A categorical semantics is proposed for the notion of architectural connector in the style defined by Allen and Garlan which adopts notions of parameterisation similar to those developed for Abstract Data Type specification, and adapts them to formalisms for parallel program design. We show how many of the claims made in [1] can be formally substantiated, and generalised to formalisms other tha...
متن کاملPolymorphic Type Theory as a Base for Categorical Logic
In this paper we present construction of polymorphic type theory and its model in terms of category theory. We extend the notion of many-typed signature to polymorphic type signature. We define polymorphic type calculi for first-, secondand higher-order types and set-theoretical semantics of first-order polymorphism. Semantics for higher-order polymorphic type calculi we construct in categorica...
متن کامل